Pipeline Fast Fourier Transform
نویسندگان
چکیده
This paper describes a novel structure for a hardwired fast Fourier transform (FFT) signal processor that promises to permit digital spectrum analysis to achieve throughput rates consistent with extremely wide-band radars. The technique is based on the use of serial storage for data and intermediate results and multiple arithmetic units each of which carries out a sparse Fourier transform. Details of the system are described for data sample sizes that are binary multiples, but the technique is applicable to any composite
منابع مشابه
The Hazard-Free Superscalar Pipeline Fast Fourier Transform Architecture and Algorithm
This chapter examines the superscalar pipeline Fast Fourier Transform algorithm and architecture. The algorithm presents a memory management scheme that avoids memory contention throughout the pipeline stages. The fundamental algorithm, a switch-based FFT pipeline architecture and an example 64-point FFT implementation are presented. The pipeline consists of log2N stages, where N is number of F...
متن کاملA VLSI Pipeline Design of a Fast Prime Factor DFT on a Finite Field
_.a conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite fieM, GF(qg ). A pipeline structure is used to implement this prime factor DFT over GF(qn). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode ReedSolomon codes. Such a pipeline fast prime factor DFT algorithm over G...
متن کاملWord Length Estimation for Memory Efficient Pipeline FFT/IFFT Processors
The Fast Fourier Transform (FFT) and its inverse transform (IFFT) processors are a key component in many communication systems. This paper presents a simulation-based method to determine the data word length for pipeline FFT/IFFT processors. This method allows designer to control the estimation process for dedicated approaches and applied to the pipeline architectures in order to lower memory r...
متن کاملIJSRD - International Journal for Scientific Research & Development| Vol. 3, Issue 10, 2015 | ISSN (online): 2321-0613
In this Paper, the architecture and FPGA implementation of a Coordinate Rotation Digital Computer (CORDIC) pipeline Fast Fourier Transform (FFT) processor is presented. Fast Fourier Transforms (FFT) is highly efficient algorithm which uses Divide and Conquer approach for speedy calculation of Discrete Fourier transform (DFT) to obtain the frequency spectrum. CORDIC algorithm which is hardware e...
متن کاملFault Detection of Pipeline in Water Distribution Network System
Water pipe network is installed underground and once equipped, it is difficult to recognize the state of pipes when the leak or burst happens. Accordingly, post management is often delayed after the fault occurs. Therefore, the systematic fault management system of water pipe network is required to prevent the accident and minimize the loss. In this work, we develop online fault detection syste...
متن کاملNew FFT structures based on the Bruun algorithm
In some signal processing applications, the input data are real. In this case, the Bruun algorithm for computation of the Discrete Fourier Transform (DFT) is attractive. This correspondence offers a pipeline and a recirculated shuffle network implementation of the Bruun algorithm. The parallel pipeline and recirculated FFT structures are implemented based on the modified perfect shuffle network.
متن کامل